Wreath Product in Factorization of Holosymmetric Group
نویسندگان
چکیده
منابع مشابه
-Factorization of the symmetric digraph of wreath product of graphs
In this paper, we show that the necessary and sufficient condition for the existence of an e Sk-factorization of (Cm ◦ Kn)∗ is n ≡ 0 (mod k(k − 1)), for all m > 3. In fact, our result together with a result of Ushio gives a complete solution for the existence of an e Sk-factorization of (Cm ◦Kn)∗ for all m ≥ 3. Further, we have obtained some necessary or sufficient conditions for the existence ...
متن کاملDistinguishing Sets under Group Actions, the Wreath Product Action
Definition 1.2 (Distinguishing number of a graph). Let Γ = (V,E) be a graph and let f : V → [r] be a coloring of the set of vertices by r colors. The map f need not be surjective, in fact when r > |V | it cannot be surjective. We say that f is r-distinguishing if the only automorphism of Γ that fixes the coloring f is the trivial automorphism. The distinguishing number of Γ is denoted by D(Γ) a...
متن کاملTwo-dimensional wreath product group-based image processing
Harmonic analysis is at the heart of much of signal and image processing. This is mainly the harmonic analysis of abelian groups, and ultimately, after sampling, and quantizing, finite abelian groups. Nevertheless, this general group theoretic viewpoint has proved fruitful, yielding a natural group-based multiresolution framework as well as some new and potentially useful nonabelian examples. T...
متن کاملA Wreath Product Group Approach to Signal Processing
We propose the use of spectral analysis on certain noncommutative finite groups in digital signal processing, and in particular, image processing. We pay significant attention to groups constructed as wreath products of cyclic groups. Within this large class of groups our approach recovers the DFT, Haar wavelet transform, various multichannel pyramid filter banks and other aspects of multiresol...
متن کاملFree Wreath Product by the Quantum Permutation Group
Let A be a compact quantum group, let n ∈ N∗ and let Aaut(Xn) be the quantum permutation group on n letters. A free wreath product construction A∗wAaut(Xn) is done. This construction provides new examples of quantum groups, and is useful to describe the quantum automorphism group of the n-times disjoint union of a finite connected graph.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Acta Physica Polonica A
سال: 1991
ISSN: 0587-4246,1898-794X
DOI: 10.12693/aphyspola.79.843